High frequency batch-oriented computations over large sliding time windows
نویسندگان
چکیده
منابع مشابه
High frequency batch-oriented computations over large sliding time windows
Today’s business workflows are very likely to include batch computations that periodically analyze subsets of data relative to specific time ranges in order to provide strategic information for stakeholders and other interested parties. The frequency of these computations directly impacts on how much updated such information can be, which provides an effective measure of their usefulness. This ...
متن کاملEffective Computations on Sliding Windows
In the streaming model, elements arrive sequentially and can be observed only once. Maintaining statistics and aggregates is an important and nontrivial task in this model. These tasks become even more challenging in the sliding windows model, where statistics must be maintained only over the most recent n elements. In their pioneering paper, Datar et al. [SIAM J. Comput., 31 (2002), pp. 1794–1...
متن کاملQuerying languages over sliding windows
We study the space complexity of querying languages over data streams in the sliding window model. The algorithm has to answer at any point of time whether the content of the sliding window belongs to a fixed regular language. For regular languages, a trichotomy is shown: For every regular language the optimal space requirement is asymptotically either constant, logarithmic, or linear in the si...
متن کاملEfficient Summing over Sliding Windows
This paper considers the problem of maintaining statistic aggregates over the last W elements of a data stream. First, the problem of counting the number of 1’s in the last W bits of a binary stream is considered. A lower bound of Ω( 1 +logW ) memory bits forW -additive approximations is derived. This is followed by an algorithm whose memory consumption is O( 1 + logW ) bits, indicating that th...
متن کاملSubmodular Maximization over Sliding Windows
In this paper we study the extraction of representative elements in the data stream model in the form of submodular maximization. Different from the previous work on streaming submodular maximization, we are interested only in the recent data, and study the maximization problem over sliding windows. We provide a general reduction from the sliding window model to the standard streaming model, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2015
ISSN: 0167-739X
DOI: 10.1016/j.future.2014.09.008